Performance Improvement through Parallelization of Graph Clustering algorithm
نویسندگان
چکیده
منابع مشابه
Performance Improvement through Parallelization of Graph Clustering algorithm
Clustering is the task of Grouping of elements or nodes (in the case of graph) in to clusters or subgroup based on some similarity metrics. In general Clustering is unsupervised learning task requires very little or prior knowledge except the data set. However Clustering Task are computationally expensive as most of the algorithms require recursion or iterations and most of the time we have to ...
متن کاملParallelization of Decision Graph Bayesian Optimization Algorithm
The traditional Bayesian optimization algorithm (BOA) is used to generate optimal solutions in Bayesian networks. To enhance performance of BOA, Decision Graphs were introduced which are helpful in parameter (variable) saving. When number of nodes in Bayesian network increases, execution time for computing optimal solution also increases proportionally. So, this paper proposes Parallelization o...
متن کاملPartial Parallelization of Graph Partitioning Algorithm METIS
The METIS graph partitioning algorithm has three stages. The first stage, coarsening, takes a large graph, with vertices |V | and edges |E|, and creates successively smaller graphs that are good representations of the original graph. The second stage partitions the small graph. The third stage, refinement, projects and refines the partition of the smaller graph onto the original graph. We prese...
متن کاملPerformance Improvement for Frequent Term-based Text Clustering Algorithm
Frequent term-based text clustering [2] is a recently introduced text clustering technique, which uses frequent term sets and dramatically decreases the dimensionality of the document vector space, thus especially addressing itself to the problems of text clustering: very high dimensionality of the date and very large size of the databases [2]. Moreover, frequent term sets provide understandabl...
متن کاملParallelization of a Hierarchical Data Clustering Algorithm Using OpenMP
This paper presents a parallel implementation of CURE, an efficient hierarchical data clustering algorithm, using the OpenMP programming model. OpenMP provides a means of transparent management of the asymmetry and non–determinism in CURE, while our OpenMP runtime support enables the effective exploitation of the irregular nested loop–level parallelism. Experimental results for various problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16241-5791